114 research outputs found

    Primary sex determination of placental mammals: a modelling study uncovers dynamical developmental constraints in the formation of Sertoli and granulosa cells

    Get PDF
    Primary sex determination in placental mammals is a very well studied developmental process. Here, we aim to investigate the currently established scenario and to assess its adequacy to fully recover the observed phenotypes, in the wild type and perturbed situations. Computational modelling allows clarifying network dynamics, elucidating crucial temporal constrains as well as interplay between core regulatory modules.Fundação Calouste Gulbenkian

    Majority rules with random tie-breaking in Boolean gene regulatory networks

    Get PDF
    We consider threshold boolean gene regulatory networks, where the update function of each gene is described as a majority rule evaluated among the regulators of that gene: it is turned ON when the sum of its regulator contributions is positive (activators contribute positively whereas repressors contribute negatively) and turned OFF when this sum is negative. In case of a tie (when contributions cancel each other out), it is often assumed that the gene keeps it current state. This framework has been successfully used to model cell cycle control in yeast. Moreover, several studies consider stochastic extensions to assess the robustness of such a model. Here, we introduce a novel, natural stochastic extension of the majority rule. It consists in randomly choosing the next value of a gene only in case of a tie. Hence, the resulting model includes deterministic and probabilistic updates. We present variants of the majority rule, including alternate treatments of the tie situation. Impact of these variants on the corresponding dynamical behaviours is discussed. After a thorough study of a class of two-node networks, we illustrate the interest of our stochastic extension using a published cell cycle model. In particular, we demonstrate that steady state analysis can be rigorously performed and can lead to effective predictions; these relate for example to the identification of interactions whose addition would ensure that a specific state is absorbing

    A modular, qualitative modelling of regulatory networks using Petri nets

    Get PDF
    International audienceAdvances in high-throughput technologies have enabled the de-lineation of large networks of interactions that control cellular processes. To understand behavioural properties of these complex networks, mathematical and computational tools are required. The multi-valued logical formalism, initially defined by R. Thomas and co-workers, proved well adapted to account for the qualitative knowledge available on regulatory interactions, and also to perform analyses of their dynamical properties. In this context, we present two representations of logical models in terms of Petri nets. In a first step, we briefly show how logical models of regulatory networks can be transposed into standard (place/transition) Petri nets, and discuss the capabilities of such representation. In the second part, we focus on logical regulatory modules and their composition, demonstrating that a high-level Petri net representation greatly facilitates the modelling of interconnected modules. Doing so, we introduce an explicit means to integrate signals from various interconnected modules, taking into account their spatial distribution. This provides a flexible modelling framework to handle regulatory networks that operate at both intra-and intercellular levels. As an illustration, we describe a simplified model of the segment-polarity module involved in the segmentation of the Drosophila embryo

    Quantification of reachable attractors in asynchronous discrete dynamics

    Full text link
    Motivation: Models of discrete concurrent systems often lead to huge and complex state transition graphs that represent their dynamics. This makes difficult to analyse dynamical properties. In particular, for logical models of biological regulatory networks, it is of real interest to study attractors and their reachability from specific initial conditions, i.e. to assess the potential asymptotical behaviours of the system. Beyond the identification of the reachable attractors, we propose to quantify this reachability. Results: Relying on the structure of the state transition graph, we estimate the probability of each attractor reachable from a given initial condition or from a portion of the state space. First, we present a quasi-exact solution with an original algorithm called Firefront, based on the exhaustive exploration of the reachable state space. Then, we introduce an adapted version of Monte Carlo simulation algorithm, termed Avatar, better suited to larger models. Firefront and Avatar methods are validated and compared to other related approaches, using as test cases logical models of synthetic and biological networks. Availability: Both algorithms are implemented as Perl scripts that can be freely downloaded from http://compbio.igc.gulbenkian.pt/nmd/node/59 along with Supplementary Material.Comment: 19 pages, 2 figures, 2 algorithms and 2 table

    Modelling the onset of senescence at the G1/S cell cycle checkpoint

    Get PDF
    DNA damage (single or double-strand breaks) triggers adapted cellular responses. These responses are elicited through signalling pathways, which activate cell cycle checkpoints and basically lead to three cellular fates: cycle arrest promoting DNA repair, senescence (permanent arrest) or cell death. Cellular senescence is known for having a tumour-suppressive function and its regulation arouses a growing scientific interest. Here, we advance a qualitative model covering DNA damage response pathways, focusing on G1/S checkpoint enforcement, supposedly more sensitive to arrest than G2/M checkpoint.Instituto Gulbenkian de CiĂȘncia (IGC), the Brazilian agency CNPq for financial support (grants 236673/2012-2, 304805/2012-2, 402547/2012-8)

    Diversity and Plasticity of Th Cell Types Predicted from Regulatory Network Modelling

    Get PDF
    Alternative cell differentiation pathways are believed to arise from the concerted action of signalling pathways and transcriptional regulatory networks. However, the prediction of mammalian cell differentiation from the knowledge of the presence of specific signals and transcriptional factors is still a daunting challenge. In this respect, the vertebrate hematopoietic system, with its many branching differentiation pathways and cell types, is a compelling case study. In this paper, we propose an integrated, comprehensive model of the regulatory network and signalling pathways controlling Th cell differentiation. As most available data are qualitative, we rely on a logical formalism to perform extensive dynamical analyses. To cope with the size and complexity of the resulting network, we use an original model reduction approach together with a stable state identification algorithm. To assess the effects of heterogeneous environments on Th cell differentiation, we have performed a systematic series of simulations considering various prototypic environments. Consequently, we have identified stable states corresponding to canonical Th1, Th2, Th17 and Treg subtypes, but these were found to coexist with other transient hybrid cell types that co-express combinations of Th1, Th2, Treg and Th17 markers in an environment-dependent fashion. In the process, our logical analysis highlights the nature of these cell types and their relationships with canonical Th subtypes. Finally, our logical model can be used to explore novel differentiation pathways in silico

    Partial Order on the set of Boolean Regulatory Functions

    Get PDF
    Logical models have been successfully used to describe regulatory and signaling networks without requiring quantitative data. However, existing data is insufficient to adequately define a unique model, rendering the parametrization of a given model a difficult task. Here, we focus on the characterization of the set of Boolean functions compatible with a given regulatory structure, i.e. the set of all monotone nondegenerate Boolean functions. We then propose an original set of rules to locally explore the direct neighboring functions of any function in this set, without explicitly generating the whole set. Also, we provide relationships between the regulatory functions and their corresponding dynamics. Finally, we illustrate the usefulness of this approach by revisiting Probabilistic Boolean Networks with the model of T helper cell differentiation from Mendoza & Xenarios

    Modelling molecular networks: relationships between different formalisms and levels of details

    Get PDF
    This document is the deliverable 1.3 of French ANR CALAMAR. It presents a study of different formalisms used for modelling and analyzing large molecular regulation networks, their formal links, in terms of mutual encodings and of abstractions, and the corresponding levels of detail captured

    Model Checking to Assess T-Helper Cell Plasticity

    Get PDF
    Computational modeling constitutes a crucial step toward the functional understanding of complex cellular networks. In particular, logical modeling has proven suitable for the dynamical analysis of large signaling and transcriptional regulatory networks. In this context, signaling input components are generally meant to convey external stimuli, or environmental cues. In response to such external signals, cells acquire specific gene expression patterns modeled in terms of attractors (e.g., stable states). The capacity for cells to alter or reprogram their differentiated states upon changes in environmental conditions is referred to as cell plasticity. In this article, we present a multivalued logical framework along with computational methods recently developed to efficiently analyze large models. We mainly focus on a symbolic model checking approach to investigate switches between attractors subsequent to changes of input conditions. As a case study, we consider the cellular network regulating the differentiation of T-helper (Th) cells, which orchestrate many physiological and pathological immune responses. To account for novel cellular subtypes, we present an extended version of a published model of Th cell differentiation. We then use symbolic model checking to analyze reachability properties between Th subtypes upon changes of environmental cues. This allows for the construction of a synthetic view of Th cell plasticity in terms of a graph connecting subtypes with arcs labeled by input conditions. Finally, we explore novel strategies enabling specific Th cell polarizing or reprograming events.LabEx MemoLife, Ecole Normale Supérieure, FCT grants: (PEst-OE/EEI/LA0021/2013, IF/01333/2013), Ph.D.program of the Agence National de Recherche sur Le Sida (ANRS), European Research Council consolidator grant
    • 

    corecore